On Threshold Circuits and Polynomial Computation
نویسندگان
چکیده
منابع مشابه
On threshold circuits and polynomial computation
A Threshold Circuit consists of an acyclic digraph of unbounded fanin, where each node computes a threshold function or its negation. This paper investigates the computational power of Threshold Circuits. A surprising relationship is uncovered between Threshold Circuits and another class of unbounded fanin circuits which are denoted Finite Field ZP (n) Circuits, where each node computes either ...
متن کاملPolynomial Threshold Functions and Boolean Threshold Circuits
We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is {1, 2}. We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being of secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two thre...
متن کاملComputation on Zagreb Polynomial of Some Families of Dendrimers
In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...
متن کاملDepth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation
The multiplication operation and the computation of symmetric functions are fundamental problems in arithmetic and algebraic computation. We describe unit-weight threshold circuits to perform the multiplication of two n-bit integers, which have fan-in k, edge complexity O(n 2+1=d), and depth O(log d + log n= log k), for any xed integer d > 0. For a given fan-in, our constructions have considera...
متن کاملOn ACC and Threshold Circuits
We prove that any language in ACC can be approximately computed by two-level circuits of size 2('Ogn)', with a symmetric-function gate at the top and only AND gates on the first level. This implies that any language in ACC can be recognized by depth-3 threshold circuits of size 2('"gn)'. This result gives the first nontrivial upper bound on the computing power of ACC circuits.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1992
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0221053